Performance evaluation of an open distributed platform for realistic traffic generation

Network researchers have dedicated a notable part of their efforts to the area of modeling traffic and to the implementation of efficient traffic generators. We feel that there is a strong demand for traffic generators capable to reproduce realistic traffic patterns according to theoretical models and at the same time with high performance. This work presents an open distributed platform for traffic generation that we called distributed internet traffic generator (D-ITG), capable of producing traffic (network, transport and application layer) at packet level and of accurately replicating appropriate stochastic processes for both inter departure time (IDT) and packet size (PS) random variables. We implemented two different versions of our distributed generator. In the first one, a log server is in charge of recording the information transmitted by senders and receivers and these communications are based either on TCP or UDP. In the other one, senders and receivers make use of the MPI library. In this work a complete performance comparison among the centralized version and the two distributed versions of D-ITG is presented

An approach to the identification of network elements composing heterogeneous end-to-end paths

n/

A Markovian Approach to Multipath Data Transfer in Overlay Networks

n/

Many or Few Samples? Comparing Transfer, Contrastive and Meta-Learning in Encrypted Traffic Classification

The popularity of Deep Learning (DL), coupled with network traffic visibility reduction due to the increased adoption of HTTPS, QUIC and DNS-SEC, re-ignited interest towards Traffic Classification (TC). However, to tame the dependency from task-specific large labeled datasets we need to find better ways to learn representations that are valid across tasks. In this work we investigate this problem comparing transfer learning, meta-learning and contrastive learning against reference Machine Learning (ML) tree-based and monolithic DL models (16 methods total). Using two publicly available datasets, namely MIRAGE19 (40 classes) and AppClassNet (500 classes), we show that (i) using large datasets we can obtain more general representations, (ii) contrastive learning is the best methodology and (iii) meta-learning the worst one, and (iv) while ML tree-based cannot handle large tasks but fits well small tasks, by means of reusing learned representations, DL methods are reaching tree-based models performance also for small tasks.Comment: to appear in Traffic Measurements and Analysis (TMA) 202

Internet traffic modeling by means of Hidden Markov Models

n/

Employing Unmanned Aerial Vehicles for Improving Handoff using Cooperative Game Theory

Heterogeneous wireless networks that are used for seamless mobility are expected to face prominent problems in future 5G cellular networks. Due to their proper flexibility and adaptable preparation, remote-controlled Unmanned Aerial Vehicles (UAVs) could assist heterogeneous wireless communication. However, the key challenges of current UAV-assisted communications consist in having appropriate accessibility over wireless networks via mobile devices with an acceptable Quality of Service (QoS) grounded on the users' preferences. To this end, we propose a novel method based on cooperative game theory to select the best UAV during handover process and optimize handover among UAVs by decreasing the (i) end-to-end delay, (ii) handover latency and (iii) signaling overheads. Moreover, the standard design of Software Defined Network (SDN) with Media Independent Handover (MIH) is used as forwarding switches in order to obtain seamless mobility. Numerical results derived from the real data are provided to illustrate the effectiveness of the proposed approach in terms of number of handovers, cost and delay